a hybrid geospatial data clustering method for hotspot analysis

traditional leveraging statistical methods for analyzing today’s large volumes of spatial data have high computational burdens. to eliminate the deficiency, relatively modern data mining techniques have been recently applied in different spatial analysis tasks with the purpose of autonomous knowledge extraction from high-volume spatial data. fortunately, geospatial data is considered a proper subject for leveraging data mining techniques. the main purpose of this paper is presenting a hybrid geospatial data clustering mechanism in order to achieve a high performance hotspot analysis method. the method basically works on 2 or 3-dimensional geographic coordinates of different natural and unnatural phenomena. it uses the systematic cooperation of two popular clustering algorithms: the aglomerative nestive, as a hierarchical clustering method and κ-means, as a partitional clustering method. it is claimed that the hybrid method will inherit the low time complexity of the κ-means algorithm and also relative independency from user’s knowledge of the agnes algorithm. thus, the proposed method is expected to be faster than agnes algorithm and also more accurate than κ-means algorithm. finally, the method was evaluated against two popular clustering measurement criteria. the first clustering evaluation criterion is adapted from fisher’s separability criterion, and the second one is the popular minimum total distance measure. results of evaluation reveal that the proposed hybrid method results in an acceptable performance. it has a desirable time complexity and also enjoys a higher cluster quality than its parents (agnes and κ-means). real-time processing of hotspots requires an efficient approach with low time complexity. so, the problem of time complexity has been taken into account in designing the proposed approach.